Intersections of Golay codes with higher order Kerdock codes
نویسندگان
چکیده
Golay codewords are useful for transmission schemes such as OFDM, and [MacWilliams/Sloane] demonstrated that these codewords are bent functions contained in second order Reed-Muller codes. This paper investigates the intersection between these codes and Kerdock-like codes.
منابع مشابه
The Z4-linearity of Kerdock, Preparata, Goethals, and related codes
Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by Nordstrom-Robinson , Kerdock, Preparata, Goethals, and Delsarte-Goethals . It is shown here that all these codes can be very simply constructed as binary images under the Gray map of linear codes over Z4, the integers mod 4 (although this requires a slight modificat...
متن کاملA linear construction for certain Kerdock and Preparata codes
The Nordstrom-Robinson, Kerdock and (slightly modified) Preparata codes are shown to be linear over 4, the integers mod 4. The Kerdock and Preparata codes are duals over 4, and the Nordstrom-Robinson code is self-dual. All these codes are just extended cyclic codes over 4. This provides a simple definition for these codes, and explains why their Hamming weight distributions are dual to each oth...
متن کامل4 - Linearity of Kerdock , Preparata , Goethals and Related Codes ∗
Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by Nordstrom-Robinson , Kerdock, Preparata, Goethals, and Delsarte-Goethals . It is shown here that all these codes can be very simply constructed as binary images under the Gray map of linear codes over 4, the integers mod 4 (although this requires a slight modificati...
متن کاملAn Exponential Number of Generalized Kerdock Codes
If a subcode of the second order Reed-Mul ler code of length 2 ~ has minimum distance 2 ~ ~ 2 (1/2)~-~ then it has at most 2 2~ words. A generalized Kerdock code is defined to be such a subcode in which this max imum is attained. Such codes were first constructed by Kerdock [7]. His codes are extended cyclic codes, in the sense that there is an au tomorphism of order 2" 1 fixing one coordinate ...
متن کاملList decoding of noisy Reed-Muller-like codes
Coding theory has played a central role in the development of computer science. One critical point of interaction is decoding error-correcting codes. Firstand second-order Reed-Muller (RM(1) and RM(2), respectively) codes are two fundamental error-correcting codes which arise in communication as well as in probabilistically-checkable proofs and learning. In this paper, the first steps are taken...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999